Models and Genetic Algorithms for the Optimal Riding Routes with Transfer Times Limited in Urban Public Transportation
نویسندگان
چکیده
With the population increase and the traffic development, urban traffic systems are becoming more and more complicated and gigantic.In this paper, we proposed a 0-1 programming model and a hypergraph model for the shortest path problem with transfer times limited. And we design the improved priority-based encoding genetic algorithm for the hypergraph model. Finally, we give a numerical example.
منابع مشابه
Optimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms
Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level ana...
متن کاملSpatiotemporal Estimation of PM2.5 Concentration Using Remotely Sensed Data, Machine Learning, and Optimization Algorithms
PM 2.5 (particles <2.5 μm in aerodynamic diameter) can be measured by ground station data in urban areas, but the number of these stations and their geographical coverage is limited. Therefore, these data are not adequate for calculating concentrations of Pm2.5 over a large urban area. This study aims to use Aerosol Optical Depth (AOD) satellite images and meteorological data from 2014 to 2017 ...
متن کاملA Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks
Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...
متن کاملModified particle swarm optimization algorithm to solve location problems on urban transportation networks (Case study: Locating traffic police kiosks)
Nowadays, traffic congestion is a big problem in metropolises all around the world. Traffic problems rise with the rise of population and slow growth of urban transportation systems. Car accidents or population concentration in particular places due to urban events can cause traffic congestions. Such traffic problems require the direct involvement of the traffic police, and it is urgent for the...
متن کاملGenetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006